#include "sort.h"
#include <stdio.h>
#include <stdlib.h>
#include <time.h>

void TestOP()
{
	srand(time(0));
	const int N = 50000;
	int* a1 = (int*)malloc(sizeof(int) * N);
	int* a2 = (int*)malloc(sizeof(int) * N);
	int* a3 = (int*)malloc(sizeof(int) * N);
	int* a4 = (int*)malloc(sizeof(int) * N);
	int* a5 = (int*)malloc(sizeof(int) * N);
	int* a6 = (int*)malloc(sizeof(int) * N);
	int* a7 = (int*)malloc(sizeof(int) * N);
	int* tmp = (int*)malloc(sizeof(int) * N);
	for (int i = 0; i < N; ++i)
	{
		a1[i] = rand();
		a2[i] = a1[i];
		a3[i] = a1[i];
		a4[i] = a1[i];
		a5[i] = a1[i];
		a6[i] = a1[i];
		a7[i] = a1[i];
	} 
	int begin1 = clock();
	direct_insert_sort(a1, N);
	int end1 = clock();
	int begin2 = clock();
	shell_sort(a2, N);
	int end2 = clock();
	int begin3 = clock();
	direct_select_sort(a3, N);
	int end3 = clock();
	int begin4 = clock();
	heap_sort(a4, N);
	int end4 = clock();
	int begin5 = clock();
	hoare_quicksort(a5, 0, N - 1);
	int end5 = clock();
	int begin6 = clock();
	merge_sort(a6, 0, N - 1, tmp);
	int end6 = clock();
	int begin7 = clock();
	bubble_sort(a7, N);
	int end7 = clock();
	printf("direct_insert_sort:%d\n", end1 - begin1);
	printf("shell_sort:%d\n", end2 - begin2);
	printf("direct_select_sort:%d\n", end3 - begin3);
	printf("heap_sort:%d\n", end4 - begin4);
	printf("hoare_quicksort:%d\n", end5 - begin5);
	printf("merge_sort:%d\n", end6 - begin6);
	printf("bubble_sort:%d\n", end7 - begin7);
	free(a1);
	free(a2);
	free(a3);
	free(a4);
	free(a5);
	free(a6);
	free(a7);
	free(tmp);
}

int main()
{
	//TestOP();
	int* arr = new int[9] {6, 1, 2, 9, 4, 2, 4, 1, 4};
	count_sort(arr, 9);
	return 0;
}